Z-cyclic whist tournaments for q players
نویسندگان
چکیده
Expanding upon a comment by P. A. Leonard (1996, Utilitas Math. 49, 223-232), we exhibit Z-cyclic patterned-starter based whist tournaments for q2 players, where q = 4k+3 is prime; the cases 3 < q < 200 are included herein, with data for 200 < q < 3,500 available electronically.
منابع مشابه
A new construction for Z-cyclic whist tournaments
In this paper, a new construction for Z-cyclic whist tournaments is given. The known existence results for both Z-cyclic whist tournaments and Z-cyclic triplewhist tournaments are extended. ? 2003 Elsevier B.V. All rights reserved.
متن کاملThe Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each game two of the players play as partners against the other two. All pairs of players must play in the same game exactly three times during the tournament; of those three times, they are to play as partners exactly once. ...
متن کاملClassification of whist tournaments with up to 12 players
A v-player whist tournament Wh(v) is a schedule of games, each involving two players opposing two others. Every round, the players are partitioned into games, with at most one player left over. Each player partners every other player exactly once and opposes every other player exactly twice during the tournament. Directed whist tournaments DWh(v), and triplewhist tournaments TWh(v), are Wh(v) w...
متن کاملGeneralized whist tournament designs
In this study a new class of tournament designs is introduced. In particular, each game of the tournament involves several (two or more) teams competing against one another. The tournament is also required to satisfy certain balance conditions that are imposed on each pair of players. These balance conditions are related to both the total number of players on each team and the number of teams i...
متن کاملVertex-transitive tournaments of order a product of two distinct primes
In this paper, we begin a classification of the vertex-transitive tournaments of order pq where p and q are distinct odd primes. In particular we characterize the pq-circulant tournaments; see Theorem 4.3. Moreover, we determine 2-closed (in Wielandt’s sense) oddorder transitive permutation groups of degree p and pq by using the classifications of vertextransitive tournaments of order p and pq....
متن کامل